Deriving Non-determinism from Conjunction and Disjunction
نویسندگان
چکیده
In this paper, we show that the non-deterministic choice “+”, which was proposed as a primitive operator in Synchronization Tree Logic (STL for short) can be defined essentially by conjunction and disjunction in the μ-calculus (μM for short). This is obtained by extending the μcalculus with the non-deterministic choice “+” (denoted by μM) and then showing that μM can be translated into μM. Furthermore, we also prove that STL can be encoded into μM and therefore into μM.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملQuasi Conjunction, Quasi Disjunction, T-norms and T-conorms: Probabilistic Aspects
We make a probabilistic analysis related to some inference rules which play an important role in nonmonotonic reasoning. In a coherence-based setting, we study the extensions of a probability assessment defined on n conditional events to their quasi conjunction, and by exploiting duality, to their quasi disjunction. The lower and upper bounds coincide with some well known t-norms and t-conorms:...
متن کاملProperties and Modeling of Partial Conjunction/Disjunction
The partial conjunction/disjunction function (PCD) integrates conjunctive and disjunctive features in a single function. Special cases of this function include the pure conjunction, the pure disjunction, and the arithmetic mean. PCD enables a continuous transition from the pure conjunction to the pure disjunction, using a parameter that specifies a desired level of conjunction (andness) or disj...
متن کاملReferential Determinism and Computational Efficiency: Posting Constraints from Deep Structure
Most transformational linguists would no longer create explicit deep structures. Instead they adopt a surface-tnterpretlve approach. We find deep structures indIspensable for projection into a semantic network. In conjunction wrth a reference architecture based on constraint-posting, they mlnlmlze referential non-determinism% We extend Marcus’ Determm~sm Hypothesis to include rmmed/ate referenc...
متن کاملGeneralized conjunction/disjunction
The generalized conjunction/disjunction function (GCD) is a continuous logic function of two or more variables that integrates conjunctive and disjunctive properties in a single function. It is used as a mathematical model of simultaneity and replaceability of inputs. Special cases of this function include the full (pure) conjunction, the partial conjunction, the arithmetic mean, the partial di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005